Set theory - PDFSEARCH.IO - Document Search Engine

Set theory
Results: 2815

#	Item
751	Choleski Algorithms for the Solution of a Set of Normal Equations Dr. Peter A. Steeves, P. Eng. Geodetic Software Systems Abstract: Algorithms for the solution of a set of normal equations by the method of Choleski are Add to Reading List Source URL: webhome.idirect.com Language: English - Date: 2002-02-19 11:40:34 Numerical linear algebra Matrices Matrix theory Control theory Cholesky decomposition Linear least squares Matrix Transpose Linear-quadratic-Gaussian control Algebra Mathematics Linear algebra
752	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 How to Cover Most of a Point Set with a V-Shape of Minimum Width Boris Aronov∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:58 Probabilistic complexity theory Randomized algorithm Outlier Algorithm RANSAC CURE data clustering algorithm Statistics Robust statistics Analysis of algorithms
753	Add to Reading List Source URL: www.aocinternational.org Language: English - Date: 2013-10-23 07:43:10 Mathematics Set theory Proof theory Large countable ordinal Mathematical logic Ordinal numbers Pagination
754	Game Theory Explorer – Software for the Applied Game Theorist arXiv:1403.3969v1 [cs.GT] 16 MarRahul Savani∗ Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2014-03-18 04:30:36 Extensive-form game Nash equilibrium Subgame Strategy Trembling hand perfect equilibrium Normal-form game Outcome Best response Information set Game theory Problem solving Economics
755	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
756	CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Approximation algorithms Functions and mappings Computational complexity theory APX Logarithm Integral Function L-reduction Metric Mathematics Theoretical computer science Mathematical analysis
757	On the Analytical Forms called Trees. By Professor Cayley. In a tree of N knots, selecting any knot at pleasure as a root, the tree may be regarded as springing from this root, and it is then called a root-tree. The same Add to Reading List Source URL: grail.cba.csuohio.edu Language: English - Date: 2007-09-21 07:13:02 Tree Knot theory Mathematics Ordinal numbers Philosophy of mathematics Learning Set theory Constructible universe Knot
758	Add to Reading List Source URL: www.aocinternational.org Language: English - Date: 2013-10-23 07:43:10 Mathematics Set theory Proof theory Large countable ordinal Mathematical logic Ordinal numbers Pagination
759	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
760	PRELIMINARY EXAMINATION GROUP IN LOGIC AND THE METHODOLOGY OF SCIENCE For the following questions we fix a standard enumeration h ϕe : e ∈ ω i of the partial recursive functions with the corresponding enumeration hWe Add to Reading List Source URL: logic.berkeley.edu Language: English Theory of computation Recursively enumerable set Enumeration Model theory Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory

UPDATE